Euclidean Distance Geometry and Applications
نویسندگان
چکیده
منابع مشابه
Euclidean Distance Geometry and Applications
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consist of an incomplete set of distances and the output is a set of points in Euclidean space realizing those given distances. We survey the theory of Euclidean distance geometry and its most important applications, with special emphasis o...
متن کاملEuclidean Distance Matrices and Applications
Over the past decade, Euclidean distance matrices, or EDMs, have been receiving increased attention for two main reasons. The first reason is that the many applications of EDMs, such as molecular conformation in bioinformatics, dimensionality reduction in machine learning and statistics, and especially the problem of wireless sensor network localization, have all become very active areas of res...
متن کاملEuclidean Geometry before non-Euclidean Geometry
In [3], in my argument for the primacy of Euclidean geometry on the basis of rigid motions and the existence of similar but non-congruent triangles, I wrote the following: A: “The mobility of rigid objects is now recognized as one of the things every normal human child learns in infancy, and this learning appears to be part of our biological progaramming.” B. “. . . we are all used to thinking ...
متن کاملDistance Geometry: Theory, Algorithms, and Chemical Applications
Distance geometry is the mathematical basis for a geometric theory of molecular conformation.1 This theory plays a role in conformational analysis analogous to that played in statistical mechanics by a hard-sphere fluid . . . which can in fact be regarded as the distance geometry description of a monoatomic fluid. More generally, a distance geometry description of a molecular system consists of...
متن کاملDIMACSWorkshop on Distance Geometry Theory and Applications
1. Tue 26 July, 9-9:30 Marcia Fampa, COPPE, Federal University of Rio de Janeiro, Brazil Modeling the Euclidean Steiner Tree problem In the Euclidean Steiner Tree Problem, the goal is to find a network of minimum length interconnecting a set P of given points in the n-dimensional Euclidean space. Such networks may be represented by a tree T , where the set of nodes is given by the points in P ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Review
سال: 2014
ISSN: 0036-1445,1095-7200
DOI: 10.1137/120875909